Mixed-Integer Linear Programming, Constraint Programming and a Novel Dedicated Heuristic for Production Scheduling in a Packaging Plant

In this paper, we are discussing a research project aiming to optimize the scheduling of production orders within real application in packaging field. As first approach, model problem as an extended version hybrid and flexible flowshop with precedence constraints, parallel machines, sequence-dependent setups. The optimization objective considered is minimization total tardiness. To tackle problem, use two methodologies: mixed-integer linear programming (MILP) constraint (CP). These models were further by adding resource calendar constraints named also availability constraints; implies that tasks should be scheduled only when machine available. different proposed compared each other on set generated benchmarks reflect specific properties industrial partner. Finally, studied configuration relies practical real-world application, where thousands produced monthly, novel dedicated heuristic was designed address need for quick solutions. latter outperforms algorithms expected tardiness minimization. can readily modified suit wide range situations involving activities share similar characteristics.